Degree hypergroupoids associated with hypergraphs
نویسندگان
چکیده
منابع مشابه
Products of hypergroupoids associated to binary relations
We study closure properties with respect to products for hypergroupoids, semihypergroups and hypergroups associated to binary relations. Using some basic category theory tools, from a certain point, the investigation turns into studying closure properties with respect to direct products for some classes of monounary multialgebras.
متن کاملCo-degree density of hypergraphs
For an r-graph H, let C(H) = minS d(S), where the minimum is taken over all (r− 1)-sets of vertices of H, and d(S) is the number of vertices v such that S ∪ {v} is an edge of H. Given a family F of r-graphs, the co-degree Turán number co-ex(n,F) is the maximum of C(H) among all r-graphs H which contain no member of F as a subhypergraph. Define the co-degree density of a family F to be γ(F) = li...
متن کاملOn existence of hypergraphs with prescribed edge degree profile
The degree profile of an edge e of a finite hypergraph H is the map assigning to a positive integer i the number of vertices of degree i incident with e. The edge degree profile of H is the map describing for any possible degree profile ~ the number of edges in H with degree profile ~. A necessary and sufficient condition for existence of hypergraphs of prescribed edge degree profile is found. ...
متن کامل$\beta$ models for random hypergraphs with a given degree sequence
Abstract: We introduce the beta model for random hypergraphs in order to represent the occurrence of multi-way interactions among agents in a social network. This model builds upon and generalizes the well-studied beta model for random graphs, which instead only considers pairwise interactions. We provide two algorithms for fitting the model parameters, IPS (iterative proportional scaling) and ...
متن کاملPerfect matching in 3 uniform hypergraphs with large vertex degree
A perfect matching in a 3-uniform hypergraph on n = 3k vertices is a subset of n3 disjoint edges. We prove that if H is a 3-uniform hypergraph on n = 3k vertices such that every vertex belongs to at least ( n−1 2 ) − ( 2n/3 2 ) + 1 edges then H contains a perfect matching. We give a construction to show that this result is best possible.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2014
ISSN: 0354-5180,2406-0933
DOI: 10.2298/fil1401119f